Space bounds for processing contentless inputs
نویسندگان
چکیده
منابع مشابه
Space Bounds for Resolution
We introduce a new way to measure the space needed in resolution refutations of CNF formulas in propositional logic. With the former de nition [11] the space required for the resolution of any unsatis able formula in CNF is linear in the number of clauses. The new de nition allows a much ner analysis of the space in the refutation, ranging from constant to linear space. Moreover, the new de nit...
متن کاملSpace Bounds for Adaptive Renaming
We study the space complexity of implementing long-lived and one-shot adaptive renaming from multi-reader multi-writer registers, in an asynchronous distributed system with n processes. As a result of an f -adaptive renaming algorithm each participating process gets a distinct name in the range {1, . . . , f (k)} provided k processes participate. Let f : {1, . . . ,n}→N be a non-decreasing func...
متن کاملSpace Bounds for Infinitary Computation
Infinite Time Turing Machines (or Hamkins-Kidder machines) have been introduced in [HaLe00] and their computability theory has been investigated in comparison to the usual computability theory in a sequence of papers by Hamkins, Lewis, Welch and Seabold: [HaLe00], [We00a], [We00b], [HaSe01], [HaLe02], [We04], [We05] (cf. also the survey papers [Ha02], [Ha04] and [Ha05]). Infinite Time Turing Ma...
متن کاملPerformance bounds for feedforward queueing networks with upper-constrained inputs
We propose a simple framework for analyzing feedforward queueing networks that have the following features: each customer belongs to a (customer) flow and the route that a customer follows in the network depends on the flow to which he belongs. The amount of traffic fed by a customer flow into the network is bounded by a deterministic subadditive function, which is called a subadditive envelope...
متن کاملBounds for Fluid Models Driven by Semi-markov Inputs
In this paper we consider an infinite buffer fluid model whose input is driven by independent semi-Markov processes+ The output capacity of the buffer is a constant+We derive upper and lower bounds for the limiting distribution of the stationary buffer content process+We discuss examples and applications where the results can be used to determine bounds on the loss probability in telecommunicat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1975
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(75)80052-3